Some problems about directed cycles and Leonard pairs
نویسندگان
چکیده
Hiroshi Suzuki visited the math department in Madison Nov 10–13, 2001. During that visit Suzuki, Jack Koolen and I had many conversations about directed versions of Leonard pairs. The following discussion and problems are based on those conversations.
منابع مشابه
Quaternionic Product of Circles and Cycles and Octonionic Product for Pairs of Circles
This paper concerns with a product of circles induced by the quaternionic product considered in a projective manner. Several properties of this composition law are derived and on this way we arrive at some special numbers as roots or powers of unit. We extend this product to cycles as oriented circles and to pairs of circles by using the algebra of octonions. Three applications of the given pro...
متن کاملSome Results about the Contractions and the Pendant Pairs of a Submodular System
Submodularity is an important property of set functions with deep theoretical results and various applications. Submodular systems appear in many applicable area, for example machine learning, economics, computer vision, social science, game theory and combinatorial optimization. Nowadays submodular functions optimization has been attracted by many researchers. Pendant pairs of a symmetric...
متن کاملMaximum Weight Cycle Packing in Directed Graphs, with Application to Kidney Exchange Programs
Centralised matching programs have been established in several countries to organise kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually the goal is to maximise the number of transpla...
متن کاملSubquadratic Algorithms for the Diameter and the Sum of Pairwise Distances in Planar Graphs
We show how to compute for n-vertex planar graphs in O(n11/6 polylog(n)) expected time the diameter and the sum of the pairwise distances. The algorithms work for directed graphs with real weights and no negative cycles. In O(n15/8 polylog(n)) expected time we can also compute the number of pairs of vertices at distance smaller than a given threshold. These are the first algorithms for these pr...
متن کاملEla Totally Bipartite/abipartite Leonard Pairs and Leonard Triples of Bannai/ito Type
This paper is about three classes of objects: Leonard pairs, Leonard triples, and the modules for a certain algebra A. Let K denote an algebraically closed field of characteristic zero. Let V denote a vector space over K with finite positive dimension. A Leonard pair on V is an ordered pair of linear transformations in End(V ) such that, for each of these transformations, there exists a basis f...
متن کامل